Markov Chain and Adaptive Parameter Selection on Particle Swarm Optimizer
نویسندگان
چکیده
Particle Swarm Optimizer (PSO) is such a complex stochastic process so that analysis on the stochastic behavior of the PSO is not easy. The choosing of parameters plays an important role since it is critical in the performance of PSO. As far as our investigation is concerned, most of the relevant researches are based on computer simulations and few of them are based on theoretical approach. In this paper, theoretical approach is used to investigate the behavior of PSO. Firstly, a state of PSO is defined in this paper, which contains all the information needed for the future evolution. Then the memory-less property of the state defined in this paper is investigated and proved. Secondly, by using the concept of the state and suitably dividing the whole process of PSO into countable number of stages (levels), a stationary Markov chain is established. Finally, according to the property of a stationary Markov chain, an adaptive method for parameter selection is proposed.
منابع مشابه
An Improved Particle Swarm Optimizer Based on a Novel Class of Fast and Efficient Learning Factors Strategies
The particle swarm optimizer (PSO) is a population-based metaheuristic optimization method that can be applied to a wide range of problems but it has the drawbacks like it easily falls into local optima and suffers from slow convergence in the later stages. In order to solve these problems, improved PSO (IPSO) variants, have been proposed. To bring about a balance between the exploration and ex...
متن کاملA Modified Particle Swarm Optimizer - Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., Th
In this paper, we introduce a new parameter, called inertia weight, into the original particle swarm optimizer. Simulations have been done to illustrate the signilicant and effective impact of this new parameter on the particle swarm optimizer.
متن کاملAdaptive Particle Swarm Optimizer: Response to Dynamic Systems through Rank-based Selection
A response method to dynamic changes based on evolutionary computation is proposed for the particle swarm optimizer. The method uses rank-based selection to replace half of the lower fitness population with the higher fitness population, when changes are detected. Time-varying values for the acceleration coefficients are proposed to keep a higher degree of global search and a lower degree of lo...
متن کاملEfficient Probabilistic Parameter Synthesis for Adaptive Systems
Probabilistic modelling has proved useful to analyseperformance, reliability and energy usage of distributed ornetworked systems. We consider parametric probabilistic models,in which probabilities are specified as expressions over a setof parameters, rather than concrete values. We address theparameter synthesis problem for parametric Markov decisionprocesses and paramet...
متن کاملHidden Markov Models Training Using Population-based Metaheuristics
In this chapter, we consider the issue of Hidden Markov Model (HMM) training. First, HMMs are introduced and then we focus on the particular HMMs training problem. We emphasize the difficulty of this problem and present various criteria that can be considered. Many different adaptations of metaheuristics have already been used but, until now, a few extensive comparisons have been performed on t...
متن کامل